Serveur d'exploration SRAS

Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.

Exact epidemic models on graphs using graph-automorphism driven lumping

Identifieur interne : 002820 ( Main/Exploration ); précédent : 002819; suivant : 002821

Exact epidemic models on graphs using graph-automorphism driven lumping

Auteurs : Péter L. Simon [Hongrie] ; Michael Taylor [Royaume-Uni] ; Istvan Z. Kiss [Royaume-Uni]

Source :

RBID : ISTEX:8FBF9A2640967B84E59F0BC736D144D4D6C5D3EA

Descripteurs français

English descriptors

Abstract

Abstract: The dynamics of disease transmission strongly depends on the properties of the population contact network. Pair-approximation models and individual-based network simulation have been used extensively to model contact networks with non-trivial properties. In this paper, using a continuous time Markov chain, we start from the exact formulation of a simple epidemic model on an arbitrary contact network and rigorously derive and prove some known results that were previously mainly justified based on some biological hypotheses. The main result of the paper is the illustration of the link between graph automorphisms and the process of lumping whereby the number of equations in a system of linear differential equations can be significantly reduced. The main advantage of lumping is that the simplified lumped system is not an approximation of the original system but rather an exact version of this. For a special class of graphs, we show how the lumped system can be obtained by using graph automorphisms. Finally, we discuss the advantages and possible applications of exact epidemic models and lumping.

Url:
DOI: 10.1007/s00285-010-0344-x


Affiliations:


Links toward previous steps (curation, corpus...)


Le document en format XML

<record>
<TEI wicri:istexFullTextTei="biblStruct">
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en">Exact epidemic models on graphs using graph-automorphism driven lumping</title>
<author>
<name sortKey="Simon, Peter L" sort="Simon, Peter L" uniqKey="Simon P" first="Péter L." last="Simon">Péter L. Simon</name>
</author>
<author>
<name sortKey="Taylor, Michael" sort="Taylor, Michael" uniqKey="Taylor M" first="Michael" last="Taylor">Michael Taylor</name>
</author>
<author>
<name sortKey="Kiss, Istvan Z" sort="Kiss, Istvan Z" uniqKey="Kiss I" first="Istvan Z." last="Kiss">Istvan Z. Kiss</name>
</author>
</titleStmt>
<publicationStmt>
<idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:8FBF9A2640967B84E59F0BC736D144D4D6C5D3EA</idno>
<date when="2010" year="2010">2010</date>
<idno type="doi">10.1007/s00285-010-0344-x</idno>
<idno type="url">https://api.istex.fr/ark:/67375/VQC-M8D7R6NL-X/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">001F53</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001F53</idno>
<idno type="wicri:Area/Istex/Curation">001F53</idno>
<idno type="wicri:Area/Istex/Checkpoint">000A73</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000A73</idno>
<idno type="wicri:doubleKey">0303-6812:2010:Simon P:exact:epidemic:models</idno>
<idno type="wicri:Area/Main/Merge">002859</idno>
<idno type="wicri:Area/Main/Curation">002820</idno>
<idno type="wicri:Area/Main/Exploration">002820</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title level="a" type="main" xml:lang="en">Exact epidemic models on graphs using graph-automorphism driven lumping</title>
<author>
<name sortKey="Simon, Peter L" sort="Simon, Peter L" uniqKey="Simon P" first="Péter L." last="Simon">Péter L. Simon</name>
<affiliation wicri:level="3">
<country xml:lang="fr">Hongrie</country>
<wicri:regionArea>Institute of Mathematics, Eötvös Loránd University Budapest, Budapest</wicri:regionArea>
<placeName>
<settlement type="city">Budapest</settlement>
<region nuts="2">Hongrie centrale</region>
</placeName>
</affiliation>
</author>
<author>
<name sortKey="Taylor, Michael" sort="Taylor, Michael" uniqKey="Taylor M" first="Michael" last="Taylor">Michael Taylor</name>
<affiliation wicri:level="4">
<country xml:lang="fr">Royaume-Uni</country>
<wicri:regionArea>Department of Mathematics, University of Sussex, Falmer, BN1 9RF, Brighton</wicri:regionArea>
<orgName type="university">Université du Sussex</orgName>
<placeName>
<settlement type="city">Brighton</settlement>
<settlement type="town">Falmer</settlement>
<region type="nation">Angleterre</region>
<region nuts="2" type="region">Sussex de l'Est</region>
</placeName>
</affiliation>
</author>
<author>
<name sortKey="Kiss, Istvan Z" sort="Kiss, Istvan Z" uniqKey="Kiss I" first="Istvan Z." last="Kiss">Istvan Z. Kiss</name>
<affiliation wicri:level="4">
<country xml:lang="fr">Royaume-Uni</country>
<wicri:regionArea>Department of Mathematics, University of Sussex, Falmer, BN1 9RF, Brighton</wicri:regionArea>
<orgName type="university">Université du Sussex</orgName>
<placeName>
<settlement type="city">Brighton</settlement>
<settlement type="town">Falmer</settlement>
<region type="nation">Angleterre</region>
<region nuts="2" type="region">Sussex de l'Est</region>
</placeName>
</affiliation>
<affiliation wicri:level="1">
<country wicri:rule="url">Royaume-Uni</country>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series>
<title level="j">Journal of Mathematical Biology</title>
<title level="j" type="abbrev">J. Math. Biol.</title>
<idno type="ISSN">0303-6812</idno>
<idno type="eISSN">1432-1416</idno>
<imprint>
<publisher>Springer-Verlag</publisher>
<pubPlace>Berlin/Heidelberg</pubPlace>
<date type="published" when="2011-04-01">2011-04-01</date>
<biblScope unit="volume">62</biblScope>
<biblScope unit="issue">4</biblScope>
<biblScope unit="page" from="479">479</biblScope>
<biblScope unit="page" to="508">508</biblScope>
</imprint>
<idno type="ISSN">0303-6812</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt>
<idno type="ISSN">0303-6812</idno>
</seriesStmt>
</fileDesc>
<profileDesc>
<textClass>
<keywords scheme="KwdEn" xml:lang="en">
<term>Epidemic</term>
<term>Graph automorphism</term>
<term>Lumping</term>
<term>Markov chain</term>
<term>Network</term>
</keywords>
<keywords scheme="Wicri" type="topic" xml:lang="fr">
<term>épidémie</term>
</keywords>
</textClass>
<langUsage>
<language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en">Abstract: The dynamics of disease transmission strongly depends on the properties of the population contact network. Pair-approximation models and individual-based network simulation have been used extensively to model contact networks with non-trivial properties. In this paper, using a continuous time Markov chain, we start from the exact formulation of a simple epidemic model on an arbitrary contact network and rigorously derive and prove some known results that were previously mainly justified based on some biological hypotheses. The main result of the paper is the illustration of the link between graph automorphisms and the process of lumping whereby the number of equations in a system of linear differential equations can be significantly reduced. The main advantage of lumping is that the simplified lumped system is not an approximation of the original system but rather an exact version of this. For a special class of graphs, we show how the lumped system can be obtained by using graph automorphisms. Finally, we discuss the advantages and possible applications of exact epidemic models and lumping.</div>
</front>
</TEI>
<affiliations>
<list>
<country>
<li>Hongrie</li>
<li>Royaume-Uni</li>
</country>
<region>
<li>Angleterre</li>
<li>Hongrie centrale</li>
<li>Sussex de l'Est</li>
</region>
<settlement>
<li>Brighton</li>
<li>Budapest</li>
<li>Falmer</li>
</settlement>
<orgName>
<li>Université du Sussex</li>
</orgName>
</list>
<tree>
<country name="Hongrie">
<region name="Hongrie centrale">
<name sortKey="Simon, Peter L" sort="Simon, Peter L" uniqKey="Simon P" first="Péter L." last="Simon">Péter L. Simon</name>
</region>
</country>
<country name="Royaume-Uni">
<region name="Angleterre">
<name sortKey="Taylor, Michael" sort="Taylor, Michael" uniqKey="Taylor M" first="Michael" last="Taylor">Michael Taylor</name>
</region>
<name sortKey="Kiss, Istvan Z" sort="Kiss, Istvan Z" uniqKey="Kiss I" first="Istvan Z." last="Kiss">Istvan Z. Kiss</name>
<name sortKey="Kiss, Istvan Z" sort="Kiss, Istvan Z" uniqKey="Kiss I" first="Istvan Z." last="Kiss">Istvan Z. Kiss</name>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Sante/explor/SrasV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002820 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 002820 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Sante
   |area=    SrasV1
   |flux=    Main
   |étape=   Exploration
   |type=    RBID
   |clé=     ISTEX:8FBF9A2640967B84E59F0BC736D144D4D6C5D3EA
   |texte=   Exact epidemic models on graphs using graph-automorphism driven lumping
}}

Wicri

This area was generated with Dilib version V0.6.33.
Data generation: Tue Apr 28 14:49:16 2020. Site generation: Sat Mar 27 22:06:49 2021